海量公交数据的人群画像算法

面向海量公交数据的人群画像对分析城市群体出行特点、交通态势等极具价值,但对数据的处理存在耗时高、质量低、解释难等问题。提出一种海量公交数据人群画像的系统化解决策略,基于PageRank算法筛选出经过重要站点的人群轨迹,极大减少目标人群的轨迹数据;提出轨迹文本化分析方法来提高人群画像的可解释性;分析确定基于余弦距离的K-means算法作为人群画像分类的聚类算法。该算法在3 000万乘客公交出行数据上的实验表明:提出的解决策略能够较为系统性地解决海量公交数据的人群画像问题,同时基于余弦距离的K-means算法的聚类效果最好且准确率约达80%。将人群画像及其轨迹使用Flow Map进行可视化展示,结果符合真实世界的人群行为特征。     

氙原子在铂表面散射的分子动力论方法

运用分子动力论方法研究气体分子 (Xe)在固壁表面 (Pt)的散射。在构造了合理的气体分子与固壁表面相互作用势模型之后 ,运用随机经典轨道方法求解气体分子及固壁原子的运动方程 ,得到气体分子运动轨迹及散射后的运动状态。结果表明 ,气体分子散射后的角度分布与Maxwellian模型存在较大差异 ,而速度基本服从半空间的Maxwellian分布。     

基于自适应原理的传感器增益故障诊断方法

基于自适应原理提出一种传感器增益故障诊断方法。首先将传感器增益故障表示为传感器偏差故障,再将其表示为执行机构故障,利用自适应原理估计出传感器偏差故障幅度,最后用最小二乘法估计出增益故障幅度。分别对有、无系统噪声和模型误差的情况进行了讨论,最后给出仿真结果     

改进型自适应推广卡尔曼滤波器的应用

针对在被动方式下进行水下目标跟踪容易导致滤波发散和收敛精度不高的问题,介绍了一种改进的自适应推广卡尔曼滤波算法。它能够在线估计虚拟观测噪声的统计特性,从而克服了观测模型线性化误差带来的不良影响。同时,通过引入修正增益函数,克服了由于观测噪声的统计特性不能精确已知而导致的滤波不稳定问题。仿真结果表明,不管是滤波精度还是收敛速度,都优于原来的自适应推广卡尔曼滤波算法     

拦截弹测量数据处理的建模与仿真

针对拦截弹上实时测得的带有随机干扰的测量值,讨论了测量数据的建模与处理方法,并结合数据处理过程中所涉及到的阶次的确定、样本数的选取和拐点问题提出数据处理的简化方法。最后给出了一个仿真算例     

高超声速伸缩翼变形飞行器轨迹多目标优化

针对高超声速条件下变形技术的应用模式，对具有伸缩翼的组合式飞行器滑翔弹道进行了多目标优化研究。介绍了伸缩翼的变形模式，给出了不同变形状态下的气动特性；建立了三自由度滑翔轨迹动力学模型和伸缩翼前缘热流计算模型；采用MOEA/D多目标优化算法，以变形条件和飞行攻角为设计变量、以最大射程和最小翼前缘总吸热量为目标函数，进行了多目标优化计算。优化结果表明，MOEA/D计算得到了相对均匀分布的Pareto最优解集，将伸缩翼外形与无变形外形相比，飞行器滑翔段射程得到了显著提高，同时伸缩翼前缘总吸热量有明显的降低。     

材料色散对全固态带隙光纤带内色散的影响

全固态光子带隙光纤已开始用于产生超连续谱,其带隙效应可以控制超连续谱的范围,但是带内的色散特性对于超连续谱的产生有着重要的影响.采用平面波法计算了同一带隙光纤不同阶带隙内的色散曲线和不同带隙光纤同阶带隙内的色散曲线,零色散波长在带内相对位置与带隙位置密切相关,在长波长区域,零色散点位于带隙的短波边;在短波区域,零色散点...     

Periodic review inventory management with contingent use of two freight modes with fixed costs

We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于聚类算法的多无人机系统任务分配

针对现有任务分配方法在任务点较多时不易解算,且计算量大的问题,提出了基于模糊C-均值聚类算法的多无人机系统任务分配方法.首先,利用模糊C-均值聚类算法得到的隶属度矩阵对任务点进行初始分配;其次,针对基于空间划分聚类可能造成各UAV任务不均衡的问题,设计任务的局部优化调整规则;最后,结合单旅行商问题,利用Tabu Sea...     

Quantifying the performance effects of idle time utilization in multiserver systems

In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.